Classical image deconvolution seeks an estimate of the true image when the blur kernel or the point spread function (PSF) of the blurring system is known a priori. However, blind image deconvolution addresses the much more complicated, but realistic problem where the PSF is unknown. Bayesian inference approach with appropriate priors on the image and the blur has been used successfully to solve this blind problem, in particular with a Gaussian prior and a joint maximum a posteriori (JMAP) estimation. However, this technique is unstable and suffers from significant ringing artifacts in various applications. To overcome these limitations, we propose a regularized version using $H^1$ regularization terms on both the sharp image and the blur kernel. We present also useful techniques for estimating the smoothing parameters.  We were able to derive an efficient algorithm that produces high quality deblurred results compared to some well-known methods in the literature.

This paper provides an in-depth evaluation of various supervised machine learning models used for predicting diabetes. It discusses the strengths and limitations of several algorithms, including Decision Trees, Random Forest, Rotation Forest, Ensemble Classifier, K-Star, Simple Bayes, Logistic Regression, Functional Tree, and Perceptron Neural Network. The study utilizes a publicly available diabetes dataset from chistio. ir, which includes 520 samples, comprising 200 diabetic patients and 320 non-diabetic patients, and assesses 16 features. Results are validated on the Weka 3. 6 open-source platform, using metrics such as AUC, classification accuracy (CA), F1 score, precision, and recall.

Over recent decades, there has been a growing interest in semi-supervised clustering. Compared to the supervised or unsupervised clustering methods for solving different real-life problems, reviewed articles show that semi-supervised clustering methods are more powerful, and even a small amount of supervised information can significantly improve the results of unsupervised methods. One popular method of incorporating partial supervised information is through labeled data. In this study, we propose a semi-supervised clustering algorithm called ConvexClust. The proposed method improves data clustering using a geometric view borrowed from the Lune concept in the connectivity index and 10% of labeled data. Clustering starts with the use of labeled data and the formation of a convex hull. It continues over the labeling of non-labeled data and the updating of the convex hull in an iterative process. Evaluations of three UCI datasets and sixteen artificial datasets show that the proposed method outperforms the other semi-supervised and traditional clustering techniques.

The volume of Farsi information on the Internet has been increasing in recent years. However, most of this information is in the form of unstructured or semi-structured free text. For quick and accurate access to the vast knowledge contained in these texts, the information extraction methods are essential to generate knowledge bases. In recent years, relation extraction as a sub-task of information extraction has received much attention. While many of these systems were developed in English and other well-known languages, the systems for information extraction in Farsi have received less attention from researchers. In this systematic research for semi-automatic relation extraction, Persian Wikipedia articles were presented as reliable and semi-structured sources. In this system, the relation extraction is performed with the assistance of patterns that are automatically obtained with an approach based on distant supervised. In order to apply the distant supervised, the vast knowledge base of Wikidata has been used as a source in perfect synchronization with Wikipedia. The results show that the average precision value for all relations is 76. 81%, which indicates an enhancement of precision compared to other methods in Farsi.